Heuristic algorithms for packing of multiple-group multicasting
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for Multiple Strip Packing
In this paper we study the Multiple Strip Packing (MSP) problem, a generalization of the well-known Strip Packing problem. For a given set of rectangles, r1, . . . , rn, with heights and widths ≤ 1, the goal is to find a non-overlapping orthogonal packing without rotations into k ∈ N strips [0, 1]× [0,∞), minimizing the maximum of the heights. We present an approximation algorithm with absolute...
متن کاملExact and Heuristic Approaches for Assignment in Multiple-Container Packing
This paper deals with cutting/packing problems in which there is a set of pieces to be allocated and arranged in a set of "containers." In an apparel manufacturing application, the containers might be unused areas of the fabric after large pieces have been placed, and the pieces of interest might be the smaller pieces. In a sheet metal application, the containers could be the sheets themselves,...
متن کاملAn empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
In this paper we consider the two-dimensional rectangular packing problem, where a fixed set of items have to be allocated on a single object. Two heuristics, which belong to the class of packing procedures that preserve bottom-left stability, are hybridised with three meta-heuristic algorithms (genetic algorithms, simulated annealing, naïve evolution) and local search heuristic (hill-climbing)...
متن کاملBin Packing Under Multiple Objectives - a Heuristic Approximation Approach
The article proposes a heuristic approximation approach to the bin packing problem under multiple objectives. In addition to the traditional objective of minimizing the number of bins, the heterogeneousness of the elements in each bin is minimized, leading to a biobjective formulation of the problem with a tradeoff between the number of bins and their heterogeneousness. An extension of the Best...
متن کاملGenetic Algorithms for the Multiple Container Packing Problem
This paper presents two variants of Genetic Algorithms (GAs) for solving the Multiple Container Packing Problem (MCPP), which is a combinatorial optimization problem comprising similarities to the Knapsack Problem and the Bin Packing Problem. Two different representation schemes are suggested, namely direct encoding and order based encoding. While order based encoded solutions are always feasib...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2002
ISSN: 0305-0548
DOI: 10.1016/s0305-0548(00)00092-7